A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks
نویسندگان
چکیده
منابع مشابه
A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks
I this paper, we propose a fast adaptive importance sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First, we estimate the minimum cross-entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer l...
متن کاملEstimating Buffer Overflows in Three Stages Using Cross-entropy
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of buffer overffow probabilities in queueing networks. The method comprises three stages. First we estimate the minimum Cross-Entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer le...
متن کاملFast simulation of buffer overflows in tandem networks of GZ/GZ/ 1 queues*
Simply b & w of iheir rarity; theestimation of the statistic8 of buffer overflows in welldimensioned aueueine networks via direct skulation is extr&v costh. One technique that &be used to reduce this cost is importance samplf&, and it has been shown previously that Iarge deviations theory on be used in conjunction with importance sampling to minimize the required simulation time. In this paper,...
متن کاملEliminating Buffer Overflows
Buffer overflow attacks are among the oldest and most common attacks used to gain privileged access to a computer system. In fact, statistics from Carnegie Mellon’s Computer Emergency Response Team reveal that buffer overflow vulnerabilities accounted for about 50% of all reported vulnerabilities in 2000 [2]. It is surprising that after almost 20 years of buffer overflow exploits, they are stil...
متن کاملOptimal Simulation of Buffer Overflows in - Queueing Systems with Application to ATM Switches*
works is M/M/l queues and Jackson networks, and it is shown how one can find an asymptotically opSimply because of their rarity, the estimation of timal simulation system for simulating buffer overthe statistics of buffer overflows in queueing s y s flows in these systems. H ~ ~ ~ ~ ~ ~ , in con. terns via direct simulation is often very expensive figurations, it is more usual to have systems w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 2004
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.1030.0139